Mining Frequent Subgraph Patterns from Uncertain Graphs
نویسندگان
چکیده
منابع مشابه
Frequent subgraph mining algorithms on weighted graphs
This thesis describes research work undertaken in the field of graph-based knowledge discovery (or graph mining). The objective of the research is to investigate the benefits that the concept of weighted frequent subgraph mining can offer in the context of the graph model based classification. Weighted subgraphs are graphs where some of the vertexes/edges are considered to be more significant t...
متن کاملMining Probabilistic Representative Frequent Patterns From Uncertain Data
Probabilistic frequent pattern mining over uncertain data has received a great deal of attention recently due to the wide applications of uncertain data. Similar to its counterpart in deterministic databases, however, probabilistic frequent pattern mining suffers from the same problem of generating an exponential number of result patterns. The large number of discovered patterns hinders further...
متن کاملReview of Algorithm for Mining Frequent Patterns from Uncertain Data
Mining frequent patterns from traditional database is an important research topic in data mining and researchers achieved tremendous progress in this field. However, with high volumes of uncertain data generated in distributed environments in many of biological, medical and life science application in the past ten years, researchers have proposed different solutions in extending the conventiona...
متن کاملVertical Mining of Frequent Patterns from Uncertain Data
Efficient algorithms have been developed for mining frequent patterns in traditional data where the content of each transaction is definitely known. There are many applications that deal with real data sets where the contents of the transactions are uncertain. Limited research work has been dedicated for mining frequent patterns from uncertain data. This is done by extending the state of art ho...
متن کاملMining Frequent Patterns in Uncertain and Relational Data Streams using the Landmark Windows
Todays, in many modern applications, we search for frequent and repeating patterns in the analyzed data sets. In this search, we look for patterns that frequently appear in data set and mark them as frequent patterns to enable users to make decisions based on these discoveries. Most algorithms presented in the context of data stream mining and frequent pattern detection, work either on uncertai...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Software
سال: 2009
ISSN: 1000-9825
DOI: 10.3724/sp.j.1001.2009.03473